Beyond the Poisson renewal process: A tutorial survey

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

a structural survey of the polish posters

تصویرسازی قابلیتهای فراوانی را دارا است

15 صفحه اول

On Functionals of a Marked Poisson Process Observed by a Renewal Process

We study the functionals of a Poisson marked process Π observed by a renewal process. A sequence of observations continues until Π crosses some fixed level at one of the observation epochs (the first passage time). In various stochastic models applications (such as queueing with N-policy combined with multiple vacations), it is necessary to operate with the value of Π prior to the first passage...

متن کامل

Fractional Poisson Process

For almost two centuries, Poisson process with memoryless property of corresponding exponential distribution served as the simplest, and yet one of the most important stochastic models. On the other hand, there are many processes that exhibit long memory (e.g., network traffic and other complex systems). It would be useful if one could generalize the standard Poisson process to include these p...

متن کامل

Physical-layer network coding: Tutorial, survey, and beyond

The concept of physical-layer network coding (PNC) was proposed in 2006 for application in wireless networks. Since then it has developed into a subfield of network coding with wide followings. The basic idea of PNC is to exploit the network coding operation that occurs naturally when electromagnetic (EM) waves are superimposed on one another. This simple idea turns out to have profound and fun...

متن کامل

EE226a - Summary of Lecture 28 Review: Part 2 - Markov Chains, Poisson Process, and Renewal Process

A deeper observation is that a Markov chain X starts afresh from its value at some random times called stopping times. Generally, a stopping time is a random time τ that is non-anticipative. That is, we can tell that τ ≤ n from {X0, X1, . . . , Xn}, for any n ≥ 0. A simple example is the first hitting time TA of a set A ⊂ X . Another simple example is TA + 5. A simple counterexample is TA − 1. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2007

ISSN: 0377-0427

DOI: 10.1016/j.cam.2006.04.060